Polynomial time multiplication and normal forms in free bands
نویسندگان
چکیده
We present efficient computational solutions to the problems of checking equality, performing multiplication, and computing minimal representatives elements free bands. A band is any semigroup satisfying identity x2≈x FB(k) object in variety k-generated Radoszewski Rytter developed a linear time algorithm for whether two words represent same element band. In this paper we describe an alternate problem. The utilises representation as synchronous deterministic transducers that lend themselves (quadratic size alphabet) multiplication This also provides means finding short-lex least word representing given with quadratic complexity.
منابع مشابه
Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithm
Published in 1962 [1], Karatsuba-Ofman algorithm (KOA) was the first integer multiplication method broke the quadratic complexity barrier in positional number systems. Due to its simplicity, its polynomial version is widely adopted to design VLSI GF (2) parallel multipliers in GF (2)based cryptosystems [9]-[27]. Two parameters are often used to measure the performance of a GF (2) parallel multi...
متن کاملOverlap-free Karatsuba-Ofman polynomial multiplication algorithms
We describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[x] Karatsuba-Ofman multipliers. The theoretical XOR gate delay of the resulting multipliers is reduced significantly. For example, it is reduced by about 33% and 25% for n = 2 and n = 3 (t > 1), respectively. To the best of our knowledge, this parameter has never been improved since ...
متن کاملDynamic Normal Forms and Dynamic Characteristic Polynomial
We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updates in O(n log n) randomized time and queries in constant time, whereas in the general case the algorithm works in O(nk log n) randomized time, where k is the number of invariant factors of the matrix. The algorithm is based on t...
متن کاملStable normal forms for polynomial system solving
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I . The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [29]. This general border basis algorithm weakens the monomial ordering requirement for Gröbner bases computations. It is up to date the ...
متن کاملNormal forms for general polynomial matrices
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomial matrix. For specific input shifts, we obtain methods for computing the matrix greatest common divisor of two matrix polynomials (in normal form) or such polynomial normal form computation as the classical Popov form and the Hermite Normal Form. The method is done by embedding the problem of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2023
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2023.113783